NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints
نویسندگان
چکیده
منابع مشابه
NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints.
Sequence pattern mining aims to discover frequent subsequences as patterns in a single sequence or a sequence database. By combining gap constraints (or flexible wildcards), users can specify special characteristics of the patterns and discover meaningful subsequences suitable for their own application domains, such as finding gene transcription sites from DNA sequences or discovering patterns ...
متن کاملProtein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences), we propose a new sequence mining algorithm (gIL). gIL was developed for linear sequence pattern mining and results from the combination of some of the most efficient techniques used in sequence and itemset mining. ...
متن کاملAlgorithm for sequence mining using gap constraints
The sequence mining problem consists in finding frequent sequential patterns in a database of timestamped events. Some application domains require limiting the maximum temporal gap between events in the input sequences. However concentration on such constraint is critical for most sequence mining algorithms. In this paper we describe CCSM (Cache-based Con-strained Sequence Miner), a new level-w...
متن کاملContrast Pattern Mining with Gap Constraints for Peptide Folding Prediction
1 In this paper, we propose a peptide folding prediction method which discovers contrast patterns to differentiate and predict peptide folding classes. A contrast pattern is defined as a set of sequentially associated amino acids which frequently appear in one type of folding but significantly infrequent in other folding classes. Our hypothesis is that each type of peptide folding has its uniqu...
متن کاملGeneralization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints
The problem of sequential pattern mining is one of the several that has deserved particular attention on the general area of data mining. Despite the important developments in the last years, the best algorithm in the area (PrefixSpan) does not deal with gap constraints and consequently doesn't allow for the introduction of background knowledge into the process. In this paper we present the gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2018
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2017.2750691